An Automata-Theoretic Completeness Proof for Interval Temporal Logic
نویسنده
چکیده
Interval Temporal Logic (ITL) is a formalism for reasoning about time periods. To date no one has proved completeness of a relatively simple ITL deductive system supporting infinite time and permitting infinite sequential iteration comparable to ω-regular expressions. We have developed a complete axiomatization for such a version of quantified ITL over finite domains and can show completeness by representing finite-state automata in ITL and then translating ITL formulas into them. Here we limit ourselves to finite time. The full paper (and another conference paper [15]) extends the approach to infinite time.
منابع مشابه
An Automata - Theoretic Completeness Proof for Interval Temporal Logic ( Extended Abstract )
Interval Temporal Logic (ITL) is a formalism for reasoning about time periods. To date no one has proved completeness of a relatively simple ITL deductive system supporting infinite time and permitting infinite sequential iteration comparable to ω-regular expressions. We have developed a complete axiomatization for such a version of quantified ITL over finite domains and can show completeness b...
متن کاملAn automata-theoretic decision procedure for propositional temporal logic with since and until
We present an automata-theoretic decision procedure for Since/Until Temporal Logic (SUTL), a linear-time propositional temporal logic with strong non-strict since and until operators. The logic, which is intended for specifying and reasoning about computer systems, employs neither next nor previous operators. Such operators obstruct the use of hierarchical abstraction and reenement and make rea...
متن کاملCompleteness for Coalgebraic Fixpoint Logic
We introduce an axiomatization for the coalgebraic fixed point logic which was introduced by Venema as a generalization, based on Moss’ coalgebraic modality, of the well-known modal mucalculus. Our axiomatization can be seen as a generalization of Kozen’s proof system for the modal mu-calculus to the coalgebraic level of generality. It consists of a complete axiomatization for Moss’ modality, e...
متن کاملA Complete Axiom System for Propositional Interval Temporal Logic with Infinite Time
Interval Temporal Logic (ITL) is an established temporal formalism for reasoning about time periods. For over 25 years, it has been applied in a number of ways and several ITL variants, axiom systems and tools have been investigated. We solve the longstanding open problem of finding a complete axiom system for basic quantifier-free propositional ITL (PITL) with infinite time for analysing nonte...
متن کاملAn Automata-Theoretic Approach to Constraint LTL
We consider an extension of linear-time temporal logic (LTL) with constraints interpreted over a concrete domain. We use a new automata-theoretic technique to show pspace decidability of the logic for the constraint systems (Z, <,=) and (N, <,=). Along the way, we give an automata-theoretic proof of a result of [1] when the constraint system satisfies the completion property. Our decision proce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000